Reasoning about knowledge using defeasible logic

نویسنده

  • Douglas Walton
چکیده

In this paper, the Carneades argumentation system is extended to represent a procedural view of inquiry in which evidence is marshalled to support or defeat claims to knowledge. The model is a sequence of moves in a collaborative group inquiry in which parties take turns making assertions about what is known or not known, putting forward evidence to support them, and subjecting these moves to criticisms. It is shown how this model of evaluating evidence in an inquiry is based on a defeasible logic using forms of argument that admit exceptions. It is contended that reasoning from absence of knowledge is as important to inquiry as positive reasoning from evidence to knowledge. The philosophical conflict between this view of reasoning about knowledge and the true-belief-plus view is explored by airing objections and replies on both sides.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Defeasible Reasoning and Partial Order Planning

Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This problem affects every aspect of a planning process. We will present an argumentation-based formalism that an agent could use for constructing plans starting from a previously introduced formalism. In such a formalism, agents repre...

متن کامل

Defeasible Logic Graphs for Decision Support

Knowledge based systems provide decision support by applying a previously developed representation of knowledge for a particular domain. We describe a method for representing knowledge about any domain using defeasible logic graphs. Because these graphs are based on a defeasible logic of the sort described in [9], they can represent uncertain or incomplete knowledge. We reason about the represe...

متن کامل

Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers

Argumentation represents a way of reasoning over a knowledge base containing possibly incomplete and/or inconsistent information, to obtain useful conclusions. As a reasoning mechanism, the way an argumentation reasoning engine reaches these conclusions resembles the cognitive process that humans follow to analyse their beliefs; thus, unlike other computationally reasoning systems, argumentatio...

متن کامل

Temporal Coherence and

We discuss data involving the temporal structure of connected discourse. Questions are raised about the relation between clause order in discourse and causal order in the world, and about the coherence of certain discourses. We maintain that interpretation is contextually in uenced by knowledge of the world and of pragmatics, and that the role of this knowledge should be formalised via a defeas...

متن کامل

An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment

Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible Logic Programming approach with an underlying argumentation based semantics, could be applied in a robotic domain for knowledge representation and reasoning about which task to perform next. At this end, we have selected a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Argument & Computation

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2011